1,046 research outputs found
Implementing Session Centered Calculi
Recently, specific attention has been devoted to the development of service oriented process calculi. Besides the foundational aspects, it is also interesting to have prototype implementations for them in order to assess usability and to minimize the gap between theory and practice. Typically, these implementations are done in Java taking advantage of its mechanisms supporting network applications. However, most of the recurrent features of service oriented applications are re-implemented from scratch. In this paper we show how to implement a service oriented calculus, CaSPiS (Calculus of Services with Pipelines and Sessions) using the Java framework IMC, where recurrent mechanisms for network applications are already provided. By using the session oriented and pattern matching communication mechanisms provided by IMC, it is relatively simple to implement in Java all CaSPiS abstractions and thus to easily write the implementation in Java of a CaSPiS process
SCC: A Service Centered Calculus
We seek for a small set of primitives that might serve as a basis for formalising and programming service oriented applications over global computers. As an outcome of this study we introduce here SCC, a process calculus that features explicit notions of service definition, service invocation and session handling. Our proposal has been influenced by Orc, a programming model for structured orchestration of services, but the SCCâs session handling mechanism allows for the definition of structured interaction protocols, more complex than the basic request-response provided by Orc. We present syntax and operational semantics of SCC and a number of simple but nontrivial programming examples that demonstrate flexibility of the chosen set of primitives. A few encodings are also provided to relate our proposal with existing ones
A dynamical gluon mass solution in a coupled system of the Schwinger-Dyson equations
We study numerically the Schwinger-Dyson equations for the coupled system of
gluon and ghost propagators in the Landau gauge and in the case of pure gauge
QCD. We show that a dynamical mass for the gluon propagator arises as a
solution while the ghost propagator develops an enhanced behavior in the
infrared regime of QCD. Simple analytical expressions are proposed for the
propagators, and the mass dependency on the scale and its
perturbative scaling are studied. We discuss the implications of our results
for the infrared behavior of the coupling constant, which, according to fits
for the propagators infrared behavior, seems to indicate that as .Comment: 17 pages, 7 figures - Revised version to be consistent with erratum
to appear in JHE
Generalised quantum weakest preconditions
Generalisation of the quantum weakest precondition result of D'Hondt and
Panangaden is presented. In particular the most general notion of quantum
predicate as positive operator valued measure (POVM) is introduced. The
previously known quantum weakest precondition result has been extended to cover
the case of POVM playing the role of a quantum predicate. Additionally, our
result is valid in infinite dimension case and also holds for a quantum
programs defined as a positive but not necessary completely positive
transformations of a quantum states.Comment: 7 pages, no figures, added references, changed conten
Polarized Substructural Session Types
Abstract. The deep connection between session-typed concurrency and linear logic is embodied in the language SILL that integrates functional and message-passing concurrent programming. The exacting nature of linear typing provides strong guarantees, such as global progress, absence of deadlock, and race freedom, but it also requires explicit resource man-agement by the programmer. This burden is alleviated in an affine type system where resources need not be used, relying on a simple form of garbage collection. In this paper we show how to effectively support both linear and affine typing in a single language, in addition to the already present unre-stricted (intuitionistic) types. The approach, based on Bentonâs adjoint construction, suggests that the usual distinction between synchronous and asynchronous communication can be viewed through the lens of modal logic. We show how polarizing the propositions into positive and negative connectives allows us to elegantly express synchronization in the type instead of encoding it by extra-logical means.
Young people's uses of celebrity: Class, gender and 'improper' celebrity
This is an Author's Accepted Manuscript of an article published in Discourse: Studies in the Cultural
Politics of Education, 34(1), 2013, copyright Taylor & Francis, available online at:
http://www.tandfonline.com/10.1080/01596306.2012.698865.In this article, we explore the question of how celebrity operates in young people's everyday lives, thus contributing to the urgent need to address celebrity's social function. Drawing on data from three studies in England on young people's perspectives on their educational and work futures, we show how celebrity operates as a classed and gendered discursive device within young people's identity work. We illustrate how young people draw upon class and gender distinctions that circulate within celebrity discourses (proper/improper, deserving/undeserving, talented/talentless and respectable/tacky) as they construct their own identities in relation to notions of work, aspiration and achievement. We argue that these distinctions operate as part of neoliberal demands to produce oneself as a âsubject of valueâ. However, some participants produced readings that show ambivalence and even resistance to these dominant discourses. Young people's responses to celebrity are shown to relate to their own class and gender position.The Arts and Humanities Research Council, the British Academy, the
Economic and Social Research Council, and the UK Resource Centre for
Women in Science Engineering and Technology
QPMC: A model checker for quantum programs and protocols
© Springer International Publishing Switzerland 2015. We present QPMC (Quantum Program/Protocol Model Checker), an extension of the probabilistic model checker ISCASMC to automatically verify quantum programs and quantum protocols. QPMC distinguishes itself from the previous quantum model checkers proposed in the literature in that it works for general quantum programs and protocols, not only those using Clifford operations. A command-line version of QPMC is available at http://iscasmc.ios.ac.cn/tool/qmc/
The New âHidden Abodeâ: Reflections on Value and Labour in the New Economy
In a pivotal section of Capital, volume 1, Marx (1976: 279) notes that, in order to understand the capitalist production of value, we must descend into the âhidden abode of productionâ: the site of the labour process conducted within an employment relationship. In this paper we argue that by remaining wedded to an analysis of labour that is confined to the employment relationship, Labour Process Theory (LPT) has missed a fundamental shift in the location of value production in contemporary capitalism. We examine this shift through the work of Autonomist Marxists like Hardt and Negri, Lazaratto and Arvidsson, who offer theoretical leverage to prize open a new âhidden abodeâ outside employment, for example in the âproduction of organizationâ and in consumption. Although they can open up this new âhidden abodeâ, without LPT's fine-grained analysis of control/resistance, indeterminacy and structured antagonism, these theorists risk succumbing to empirically naive claims about the ânew economyâ. Through developing an expanded conception of a ânew hidden abodeâ of production, the paper demarcates an analytical space in which both LPT and Autonomist Marxism can expand and develop their understanding of labour and value production in today's economy. </jats:p
- âŠ